A New Construction of Job-Shop Scheduling System Integrating ILOG and MAS LiZhi Qin and QingSong Li Design and Implementation of Middle Layer for DetachedCriteria Query Based on JSF and Hibernate Framework
نویسندگان
چکیده
In the team orienteering problem (TOP) a set of locations is given, each with a score. The goal is to determine a fixed number of routes, limited in length, that visit some locations and maximize the sum of the collected scores. The team orienteering problem is often used as a starting point for modeling many combinatorial optimization problems. This paper studies the dynamic team orienteering problem considering the travel cost varying with times and visiting time constraints. After a mixed integer programming model is proposed, a novel optimal dynamic labeling algorithm is designed based on the idea of network planning and dynamic programming. Finally, a numerical example is presented to show the validity and feasibility of this algorithm.
منابع مشابه
A New Construction of Job-Shop Scheduling System Integrating ILOG and MAS
While manufacturing industry facing tough market competition, quickly responsive and flexible Job-Shop Scheduling System, JSSS, seems more attractive in nowadays. Research and applications on JSSS were summarized in this paper. A new framework of JSSS was designed in our research. A synthetic method was used here in order for efficiency and practicality. We took advantage of Multi-Agent System ...
متن کاملDesign and Implementation of Middle Layer for DetachedCriteria Query Based on JSF and Hibernate Framework
With the rapid development of Internet, B/S architecture has occupied the dominate place in information system engineering. Countless frameworks have emerged to boost the development of B/S systems. But how to take advantage of the convenience and avoid being tied to the chariot of these frameworks has become a dilemma for programmers. The paper analyzed the shortage of general query in layered...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملA Hierarchical Production Planning and Finite Scheduling Framework for Part Families in Flexible Job-shop (with a case study)
Tendency to optimization in last decades has resulted in creating multi-product manufacturing systems. Production planning in such systems is difficult, because optimal production volume that is calculated must be consistent with limitation of production system. Hence, integration has been proposed to decide about these problems concurrently. Main problem in integration is how we can relate pro...
متن کامل